- infinite tape
- мат.бесконечная лента
English-Russian scientific dictionary. 2008.
infinite tape
Смотреть что такое "infinite tape" в других словарях:
Infinite (album) — Infobox Album | Name = Infinite Type = Album Artist = Eminem Released = November 1996 Recorded = 1995 1996 Genre = Underground hip hop Length = 37:56 Label = Web Producer = Jeff Mark Bass Denaun Porter Slim DJ Head Reviews = *Allmusic… … Wikipedia
Towards Thee Infinite Beat — Infobox Album Name = Towards Thee Infinite Beat Type = studio Artist = Psychic TV Released = 1990 Recorded = Genre = Length = Label = Temple Records Producer = Reviews = Last album = This album = Next album = Towards Thee Infinite Beat is an… … Wikipedia
Actual infinity — is the idea that numbers, or some other type of mathematical object, can form an actual, completed totality; namely, a set. Hence, in the philosophy of mathematics, the abstraction of actual infinity involves the acceptance of infinite entities,… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Busy beaver — In computability theory, a busy beaver (from the colloquial expression for an industrious person) is a Turing machine that attains the maximum operational busyness (such as measured by the number of steps performed, or the number of nonblank… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
logic, philosophy of — Philosophical study of the nature and scope of logic. Examples of questions raised in the philosophy of logic are: In virtue of what features of reality are the laws of logic true? ; How do we know the truths of logic? ; and Could the laws of… … Universalium
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
